5.11(b)
An algorithm takes 0.5 ms for input size 100.  How long will it take for 
input size 500 (assuming that low-order terms are negligible) if the running time is:

a. linear
b. n log n
c. quadratic
d. cubic







5.15(a)
Give a Big-Oh analysis of the running time for the following program
fragment.


// Fragment #7
for (int i=0; i < n; ++i)
	for (int j=0; j < n * n; ++j)
		for (int k=0; k < j; ++k)
			++sum;






// Modified Fragment #7
for (int i=0; i < n; ++i)
	for (int j=0; j < n * n; ++j)
		for (int k=0; k < j; ++k)
			sub(n);


void sub(int n)
{
	for (int i=n; i >= 1; i /= 2) {
		++sum;
	}
}